I/O Efficieny of Highway Hierarchies
نویسندگان
چکیده
Recently, Sanders and Schultes presented a shortest path algorithm, named Highway Hierarchies, for fast point-to-point shortest path queries. They report extremely quick average queries on the road network of USA. We consider the I/O efficiency of the algorithm and investigate how a good graph layout affects the average query time. We experiment with a few layout heuristics and obtain a speed-up factor of around 1.3 as compared to the default layout and around 1.7 as compared to a random layout.
منابع مشابه
Highway Hierarchies Star
We study two speedup techniques for route planning in road networks: highway hierarchies (HH) and goal directed search using landmarks (ALT). It turns out that there are several interesting synergies. Highway hierarchies yield a way to implement landmark selection more efficiently and to store landmark information more space efficiently than before. ALT gives queries in highway hierarchies an e...
متن کاملComputing Many-to-Many Shortest Paths Using Highway Hierarchies
We present a fast algorithm for computing all shortest paths between source nodes s ∈ S and target nodes t ∈ T . This problem is important as an initial step for many operations research problems (e.g., the vehicle routing problem), which require the distances between S and T as input. Our approach is based on highway hierarchies, which are also used for the currently fastest speedup techniques...
متن کاملSearch-Space Size in Contraction Hierarchies
This thesis is concerned with a so-called speedup technique for Dijkstra’s algorithm: Contraction hierarchies. We present a model of contraction hierachies sufficiently sophisticated to capture real-world applications but yet concise enough to lend itself to theoretical investigations. This model reveals an interrelation between contraction hierarchies and filled graphs that directly relates th...
متن کاملRoute Planning in Road Networks
Computing optimal routes in road networks is one of the showpieces of realworld applications of algorithmics. In principle, we could use Dijkstra’s algorithm—the ‘classic’ solution from graph theory. But for large road networks this would be far too slow. Therefore, there is considerable interest in speedup techniques, which typically invest some time into a preprocessing step in order to gener...
متن کاملFast Computation of Distance Tables using Highway Hierarchies
This technical report considers the problem of computing distances of shortest paths between all pairs of nodes from given sets of sources and targets. The straightforward method to solve this is to run Dijkstra’s Algorithm once for every source: during one run the distances from one source node to all target nodes are determined. If we deal with large road networks and numerous sources and tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006